Approximate distance oracles
نویسندگان
چکیده
منابع مشابه
Approximating Approximate Distance Oracles
Given a finite metric space (V, d), an approximate distance oracle is a data structure which, when queried on two points u, v ∈ V , returns an approximation to the the actual distance between u and v which is within some bounded stretch factor of the true distance. There has been significant work on the tradeoff between the important parameters of approximate distance oracles (and in particular...
متن کاملApproximate Distance Oracles Revisited
Let G be a geometric t-spanner in E with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + ")-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.
متن کاملApproximate Distance Oracles with Improved Query Time
Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 2, we show that a (2k − 1)-approximate distance oracle for G of size O(kn) and with O(log k) query time can be constructed in O(min{kmn1/k, √ km+kn √ k}) time for some constant c. This improves the O(k) query time of Thorup and Zwick. Furthermore, for any 0 < ǫ ≤ 1, we give an oracle of...
متن کاملSpace-efficient path-reporting approximate distance oracles
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n log n space bound of Thorup and Zwick if approximate paths rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously bes...
متن کاملApproximate distance oracles with improved preprocessing time
Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 1, we show that for some universal constant c, a (2k − 1)approximate distance oracle for G of size O(kn) can be constructed in O( √ km+kn √ ) time and can answer queries in O(k) time. We also give an oracle which is faster for smaller k. Our results break the quadratic preprocessing tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2005
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1044731.1044732